Geometric Crossover for Permutations with Repetitions: Applications to Graph Partitioning
نویسندگان
چکیده
Geometric crossover is a representation-independent generalization of the traditional crossover defined using the distance of the solution space. By choosing a distance firmly rooted in the syntax of the solution representation as basis for geometric crossover, one can design new crossovers for any representation. In previous work we have applied geometric crossover to simple permutations. In this paper we design a new geometric crossover for permutations with repetitions that naturally suits partition problems and test it on the graph partitioning problem. Our new crossover outperforms all previous ones.
منابع مشابه
Cycle Crossover for Permutations with Repetitions Application to Graph Partitioning Technical Report CSM-454
Geometric crossover is a representation-independent generalisation of the traditional crossover defined using the distance of the solution space. By choosing a distance firmly rooted in the syntax of the solution representation as basis for geometric crossover, one can design new crossovers for any representation. In previous work, we have applied geometric crossover to simple permutations. In ...
متن کاملGeometric Crossovers for Multiway Graph Partitioning
Geometric crossover is a representation-independent generalization of the traditional crossover defined using the distance of the solution space. By choosing a distance firmly rooted in the syntax of the solution representation as a basis for geometric crossover, one can design new crossovers for any representation. Using a distance tailored to the problem at hand, the formal definition of geom...
متن کاملGraph Partitioning Algorithms with Applications to Scientific Computing Graph Partitioning Algorithms
Identifying the parallelism in a problem by partitioning its data and tasks among the processors of a parallel computer is a fundamental issue in parallel computing. This problem can be modeled as a graph partitioning problem in which the vertices of a graph are divided into a speciied number of subsets such that few edges join two vertices in diierent subsets. Several new graph partitioning al...
متن کاملArchitectural Enhancements for Fast Subword Permutations with Repetitions in Cryptographic Applications
We propose two new instructions, swperm and sieve, that can be used to efficiently complete an arbitrary bit-level permutation of an n-bit word with or without repetitions. Permutations with repetitions are rearrangements of an ordered set in which elements may replace other elements in the set; such permutations are useful in cryptographic algorithms. On a 4-way superscalar processor, an arbit...
متن کاملDesign and Evaluation of a Method for Partitioning and Offloading Web-based Applications in Mobile Systems with Bandwidth Constraints
Computation offloading is known to be among the effective solutions of running heavy applications on smart mobile devices. However, irregular changes of a mobile data rate have direct impacts on code partitioning when offloading is in progress. It is believed that once a rate-adaptive partitioning performed, the replication of such substantial processes due to bandwidth fluctuation can be avoid...
متن کامل